Non-Three-Colourable Common Graphs Exist
نویسندگان
چکیده
1School of Computer Science, McGill University, Montreal, Canada (e-mail: [email protected]) 2Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstı́ 25, 118 00 Prague, Czech Republic and DIMAP, Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK (e-mail: [email protected]) 3Institute for Theoretical Computer Science, Faculty of Mathematics and Physics, Charles University, Malostranské náměstı́ 25, 118 00 Prague, Czech Republic (e-mail: [email protected]) 4Department of Mathematics, Princeton University, Princeton, NJ, USA (e-mail: [email protected]) 5Department of Computer Science, University of Chicago, IL, USA (e-mail: [email protected])
منابع مشابه
Three-colourable perfect graphs without even pairs
We still do not know how to construct the “most general” perfect graph, not even the most general three-colourable perfect graph. But constructing all perfect graphs with no even pairs seems easier, and here we make a start on it; we construct all three-connected three-colourable perfect graphs without even pairs and without clique cutsets. They are all either line graphs of bipartite graphs, o...
متن کاملEvery circle graph of girth at least 5 is 3-colourable
It is known that every triangle-free (equivalently, of girth at least 4) circle graph is 5-colourable (Kostochka, 1988) and that there exist examples of these graphs which are not 4-colourable (Ageev, 1996). In this note we show that every circle graph of girth at least 5 is 2-degenerate and, consequently, not only 3-colourable but even 3-choosable.
متن کاملThe existence of uniquely -G colourable graphs
Given graphs F and G and a nonnegative integer k, a function n : V(F) ~ {1 . . . . . k} is a G k-colouring of F if no induced copy of G is monochromatic; F is G k-chromatic if F has a G k-colouring but no G (k 1)-colouring. Further, we say F is uniquely G k-colourable if F is G k-chromatic and, up to a permutation of colours, it has only one G k-colouring. Such notions are extensions of the wel...
متن کاملK4-free graphs with no odd holes
All K4-free graphs with no odd hole and no odd antihole are three-colourable, but what about K4free graphs with no odd hole? They are not necessarily three-colourable, but we prove a conjecture of Ding that they are all four-colourable. This is a consequence of a decomposition theorem for such graphs; we prove that every such graph either has no odd antihole, or belongs to one of two explicitly...
متن کاملFace Two-colourable Triangulations of K 13
Face two-colourable triangular embeddings of complete graphs Kn correspond to biembeddings of Steiner triple systems. Such embeddings exist only if n is congruent to 1 or 3 modulo 6. In this paper we present the number of these embeddings for n = 13.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 21 شماره
صفحات -
تاریخ انتشار 2012